A parallel search game
نویسندگان
چکیده
We answer in negative a question of Gál and Miltersen [3] about a combinatorial game arising in the study of timespace trade-offs for data structures.
منابع مشابه
APHID: Asynchronous Parallel Game-Tree Search
Most parallel game-tree search approaches use synchronous methods, where the work is concentrated within a specific part of the tree, or at a given search depth. This article shows that asynchronous game-tree search algorithms can be as efficient as or better than synchronous methods in determining the minimax value. APHID, a new asynchronous parallel game-tree search algorithm, is presented. A...
متن کاملSolving Amazons *
We present a method of exhaustively solving the popular combinatorial game Amazons in a parallel setting. The game has a high branching factor with high overlap, making it difficult to search in parallel. We exploit some structural properties of game positions to minimise game tree expansion, and use a parallel breadth-first search algorithm on the game tree. Throughput is maximised by allowing...
متن کاملThe APHID parallel αβ search algorithm
This paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) game-tree search algorithm. APHID represents a departure from the approaches used in practice. Instead of parallelism based on the minimal search tree, APHID uses a truncated gametree and all of the leaves of that tree are searched in parallel. APHID has been programmed as an easy to implement, game-indepen...
متن کاملProblems in Sequential and Parallel Game Tree Search
The |{ algorithm is an eecient technique for searching game trees. As parallel computers become more available, it is important to have good parallel game tree search algorithms. Until now it is an open problem whether a linear speedup can be achieved with respect to sequential alpha{ beta. This note presents a sample of game trees with distinct leaf values, which are easy for sequential alpha{...
متن کاملSearching Game Trees in Parallel
We present a new parallel game-tree search algorithm. Our approach classifies a processor’s available work as either mandatory (necessary for the solution) or speculative (may be necessary for the solution). Due to the nature of parallel game tree search, it is not possible to keep all processors busy with mandatory work. Our algorithm ER allows potential speculative work to be dynamically orde...
متن کاملA Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect
Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 27 شماره
صفحات -
تاریخ انتشار 2005